Parsing engineering and empirical robustness

Parsing Engineering and Empirical Robustness 3

Robustness beyond shallowness: incremental deep parsing

Robustness is a key issue for natural language processing in general and parsing in particular, and many approaches have been explored in the last decade for the design of robust parsing systems. Among those approaches is shallow or partial parsing, which produces minimal and incomplete syntactic structures, often in an incremental way. We argue that with a systematic incremental methodology on...

Automatic Evaluation of Robustness and Degradation in Tagging and Parsing

We address the topic of automatic evaluation of robustness and performance degradation in parsing systems. We focus on one aspect of robustness, namely ill-formed sentences and the impact of spelling errors on the different components of a parsing system. We propose an automated framework to evaluate robustness, where ill-formed and noisy data is introduced using an automatic tool and fed to th...

Efficiency, Robustness and Accuracy in Picky Chart Parsing

T h i s p a p e r d e s c r i b e s P i c k y , a p r o b a b i l i s t i c a g e n d a b a s e d c h a r t p a r s i n g a l g o r i t h m w h i c h u s e s a t e c h n i q u e ca l led p~'obabilistic prediction to predict which grammar rules are likely to lead to an acceptable parse of the input. Using a suboptimal search method, "Picky significantly reduces the number of edges produced by CK...

Eeciency, Robustness and Accuracy in Picky Chart Parsing

This paper describes Picky, a probabilistic agenda-based chart parsing algorithm which uses a technique called prob-abilistic prediction to predict which grammar rules are likely to lead to an acceptable parse of the input. Using a subopti-mal search method, Picky signiicantly reduces the number of edges produced by CKY-like chart parsing algorithms, while maintaining the robustness of pure bot...